Parameterized model checking of rendezvous systems
نویسندگان
چکیده
منابع مشابه
Model-Checking Parameterized Systems
In this paper we present a new abstraction technique that enables the usage of model checking for the verification of parameterized systems. The technique targets asynchronous systems. Compared to previous approaches the application of the proposed technique imposes fewer restrictions on the correctness property. Moreover, it can be applied to a class of parameterized systems for which other ab...
متن کاملParameterized Model Checking of Token-Passing Systems
We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL∗\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL∗\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL\X, provi...
متن کاملModel Checking Parameterized Asynchronous Shared-Memory Systems
We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the cas...
متن کاملParameterized Compositional Model Checking
The Parameterized Compositional Model Checking Problem (PCMCP) is to decide, using compositional proofs, whether a property holds for every instance of a parameterized family of process networks. Compositional analysis focuses attention on the neighborhood structure of processes in the network family. For the verification of safety properties, the PCMCP is shown to be much more tractable than t...
متن کاملParameterized Model-Checking of Timed Systems with Conjunctive Guards
In this work we extend the Emerson and Kahlon’s cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e. systems obtained by an apriori unknown number of Timed Automata instantiated from a finite set U1, . . . , Un of Timed Automata templates. In this way we aim at giving a tool to universally verify software systems where an unknown number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2017
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-017-0302-6